Asymptotic expansions in n-1 for percolation critical values on the n-Cube and Zn
نویسندگان
چکیده
We use the lace expansion to prove that the critical values for nearest-neighbour bond percolation on the n-cube {0, 1}n and on the integer lattice Zn have asymptotic expansions, with rational coefficients, to all orders in powers of n−1. 1 Main results 1.1 Main result for Z We consider bond percolation on Z with edge set consisting of pairs {x, y} of vertices in Z with ‖x−y‖1 = 1, where ‖w‖1 = nj=1 |wj| for w ∈ Z. Bonds (edges) are independently occupied with probability p and vacant with probability 1− p. The critical value is defined by pc(Z) = inf{p : ∃ an infinite connected cluster of occupied bonds a.s.}. (1.1) Given a vertex x of Z, let C(x) denote the connected cluster of x, i.e., the set of vertices y such that y is connected to x by a path consisting of occupied bonds. Let |C(x)| denote the cardinality of C(x), and let χ(p) = Ep|C(0)| denote the expected cluster size of the origin. Results of [1, 21] imply that pc(Z) = sup{p : χ(p) < ∞}. (1.2) is an equivalent definition of the critical value. Our main result for Z is the following theorem. Theorem 1.1. Consider bond percolation on Z. There are rational numbers ai(Z) such that for all M ≥ 1, pc(Z) = M ∑ i=1 ai(Z)(2n)−i + O((2n)−M−1) as n →∞. (1.3) The constant in the error term depends on M . ∗Department of Mathematics and Computer Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB Eindhoven, The Netherlands. [email protected] †Department of Mathematics, University of British Columbia, Vancouver, BC V6T 1Z2, Canada. [email protected]
منابع مشابه
Asymptotic expansions in n−1 for percolation critical values on the n-cube and Z
We use the lace expansion to prove that the critical values for nearest-neighbour bond percolation on the n-cube {0, 1}n and on Zn have asymptotic expansions, with rational coefficients, to all orders in powers of n−1. 1 Main result We consider bond percolation on Z with edge set consisting of pairs {x, y} of vertices in Z with ‖x−y‖1 = 1, where ‖w‖1 = nj=1 |wj| for w ∈ Z. Bonds (edges) are ind...
متن کاملan 2 00 4 Expansion in n − 1 for percolation critical values on the n - cube and Z n : the first three terms
Let pc(Qn) and pc(Z n) denote the critical values for nearest-neighbour bond percolation on the n-cube Qn = {0, 1} n and on Zn, respectively. Let Ω = n for G = Qn and Ω = 2n for G = Zn denote the degree of G. We use the lace expansion to prove that for both G = Qn and G = Zn, pc(G) = Ω −1 +Ω + 7 2 Ω + O(Ω). This extends by two terms the result pc(Qn) = Ω −1 + O(Ω−2) of Borgs, Chayes, van der Ho...
متن کاملExpansion in n−1 for percolation critical values on the n-cube and Z: the first three terms
Let pc(Qn) and pc(Z) denote the critical values for nearest-neighbour bond percolation on the n-cube Qn = {0, 1}n and on Zn, respectively. Let Ω = n for G = Qn and Ω = 2n for G = Zn denote the degree of G. We use the lace expansion to prove that for both G = Qn and G = Zn, pc(G) = Ω−1 + Ω−2 + 7 2 Ω−3 + O(Ω−4). This extends by two terms the result pc(Qn) = Ω−1 + O(Ω−2) of Borgs, Chayes, van der ...
متن کاملSecond Order Moment Asymptotic Expansions for a Randomly Stopped and Standardized Sum
This paper establishes the first four moment expansions to the order o(a^−1) of S_{t_{a}}^{prime }/sqrt{t_{a}}, where S_{n}^{prime }=sum_{i=1}^{n}Y_{i} is a simple random walk with E(Yi) = 0, and ta is a stopping time given by t_{a}=inf left{ ngeq 1:n+S_{n}+zeta _{n}>aright} where S_{n}=sum_{i=1}^{n}X_{i} is another simple random walk with E(Xi) = 0, and {zeta _{n},ngeq 1} is a sequence of ran...
متن کاملAsymptotic Distributions of Estimators of Eigenvalues and Eigenfunctions in Functional Data
Functional data analysis is a relatively new and rapidly growing area of statistics. This is partly due to technological advancements which have made it possible to generate new types of data that are in the form of curves. Because the data are functions, they lie in function spaces, which are of infinite dimension. To analyse functional data, one way, which is widely used, is to employ princip...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Random Struct. Algorithms
دوره 27 شماره
صفحات -
تاریخ انتشار 2005